EMBEDDING SPANNING BOUNDED DEGREE GRAPHS IN RANDOMLY PERTURBED GRAPHS
نویسندگان
چکیده
منابع مشابه
Bounded-Degree Spanning Trees in Randomly Perturbed Graphs
We show that for any xed dense graph G and bounded-degree tree T on the same number of vertices, a modest random perturbation of G will typically contain a copy of T . This combines the viewpoints of the well-studied problems of embedding trees into xed dense graphs and into random graphs, and extends a sizeable body of existing research on randomly perturbed graphs. Speci cally, we show that t...
متن کاملSpanning Trees of Bounded Degree Graphs
We consider lower bounds on the number of spanning trees of connected graphs with degree bounded by d. The question is of interest because such bounds may improve the analysis of the improvement produced by memorisation in the runtime of exponential algorithms. The value of interest is the constant βd such that all connected graphs with degree bound ed by d have at least β d spanning trees wher...
متن کاملPacking bounded-degree spanning graphs from separable families
Let G be a separable family of graphs. Then for all positive constants and ∆ and for every su ciently large integer n, every sequence G1, . . . , Gt ∈ G of graphs of order n and maximum degree at most ∆ such that e(G1)+· · ·+e(Gt) ≤ (1− ) ( n 2 ) packs into Kn. This improves results of Böttcher, Hladký, Piguet, and Taraz when G is the class of trees and of Messuti, Rödl, and Schacht in the case...
متن کاملEmbedding nearly-spanning bounded degree trees
We derive a sufficient condition for a sparse graph G on n vertices to contain a copy of a tree T of maximum degree at most d on (1 − )n vertices, in terms of the expansion properties of G. As a result we show that for fixed d ≥ 2 and 0 < < 1, there exists a constant c = c(d, ) such that a random graph G(n, c/n) contains almost surely a copy of every tree T on (1− )n vertices with maximum degre...
متن کاملk-forested choosability of graphs with bounded maximum average degree
A proper vertex coloring of a simple graph is $k$-forested if the graph induced by the vertices of any two color classes is a forest with maximum degree less than $k$. A graph is $k$-forested $q$-choosable if for a given list of $q$ colors associated with each vertex $v$, there exists a $k$-forested coloring of $G$ such that each vertex receives a color from its own list. In this paper, we prov...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematika
سال: 2020
ISSN: 0025-5793,2041-7942
DOI: 10.1112/mtk.12005